On using symmetric polynomials for constructing root finding methods
نویسندگان
چکیده
منابع مشابه
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...
متن کاملMcmullen’s Root-finding Algorithm for Cubic Polynomials
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
متن کاملA Family of Optimal Multipoint Root-Finding Methods Based on the Interpolating Polynomials
A family of simple derivative-free multipoint iterative methods, based on the interpolating polynomials, for solving nonlinear equations is presented. It is shown that the presented n-point iterative method has the convergence order 2n−1 with n function evaluations per iteration. It is an optimal iterative method in the sense of the Kung-Traub’s conjecture. Numerical examples are included to su...
متن کاملFinding Roots of Polynomials Based on Root Moments
This paper proposes using root moment method to find the roots of arbitrary polynomials. It has been proved that feedforward neural networks (FNN) trained with constrained learning (CL) back propagation (BP) algorithm can be used to estimate the distributions of roots of polynomials. It has been found, however, that using the different priori information implicit in the polynomials for CL-BP al...
متن کاملSome High-order Zero-finding Methods Using Almost Orthogonal Polynomials
Some multipoint iterative methods without memory, for approximating simple zeros of functions of one variable, are described. For m > 0, n ≥ 0, and k satisfying m+1 ≥ k > 0, there exist methods which, for each iteration, use one evaluation of f, f ′, . . . , f (m), followed by n evaluations of f (k), and have order of convergence m + 2n + 1. In particular, there are methods of order 2(n+1) whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2020
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3531